Efficient IP table lookup via adaptive stratified trees with selective reconstructions
نویسندگان
چکیده
منابع مشابه
Energy-Efficient Computing Using Adaptive Table Lookup
Table lookup based function computation can significantly save energy consumption. However existing table lookup methods are mostly used in ASIC designs for some fixed functions. The goal of this paper is to enable table lookup computation in general-purpose processors, which requires adaptive lookup tables for different applications. We provide a complete design flow to support this requiremen...
متن کاملIP Lookup Table Design using LC-trie with Memory Constraint
IP address lookup is to determine the next hop destination o f an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propos...
متن کاملMultiway range trees: scalable IP lookup with fast updates
Internet routers forward packets based on the destination address of a packet. A packet's address is matched against the destination prefixes stored in the router's forwarding table, and the packet is sent to the output interface determined by the longest matching prefix. While some existing schemes work well for IPv4 addresses, we believe that none of the current schemes scales well to IPv6, e...
متن کاملTowards More Power Efficient Ip Lookup Engines
Towards More Power Efficient IP Lookup Engines. (December 2005) Seraj Ahmad, Bachelor of Technology, Indian Institute of Technology, Guwahati, India Chair of Advisory Committee: Dr. Rabi N. Mahapatra The IP lookup in internet routers requires implementation of the longest prefix match algorithm. The software or hardware implementations of routing trie based approaches require several memory acc...
متن کاملHigh Performance IP Routing Table Lookup using CPU Caching
Wire-speed IP (Internet Protocol) routers require very fast routing table lookup for incoming IP packets. The routing table lookup operation is time consuming because the part of an IP address used in the lookup, i.e., the network address portion, is variable in length. This paper describes the routing table lookup algorithm used in a cluster-based parallel IP router project called Suez. The in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2008
ISSN: 1084-6654,1084-6654
DOI: 10.1145/1227161.1278376